Automata theory based on quantum logic: Reversibilities and pushdown automata
نویسندگان
چکیده
منابع مشابه
On Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملAutomata theory based on unsharp quantum logic
By studying two unsharp quantum structures, namely extended lattice ordered effect algebras and lattice ordered QMV algebras, we obtain some characteristic theorems of MV algebras. We go on to discuss automata theory based on these two unsharp quantum structures. In particular, we prove that an extended lattice ordered effect algebra (or a lattice ordered QMV algebra) is an MV algebra if and on...
متن کاملQuantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity c...
متن کاملOn probabilistic pushdown automata
We study the most important probabilistic computation modes for pushdown automata. First we show that deterministic pushdown automata (pda) are weaker than Las Vegas pda, which in turn are weaker than one-sided-error pda. Next one-sidederror pda are shown to be weaker than (nondeterministic) pda. Finally bounded error two-sided error pda and nondeterministic pda are incomparable. To show the li...
متن کاملQuantum Pushdown Automata with a Garbage Tape
Several kinds of quantum pushdown automata have been proposed, and their computational power is investigated intensively. However, for some quantum pushdown automaton models, it is not known whether quantum models are at least as powerful as classical counterparts or not. This is due to the reversibility restriction. In this paper, we introduce a new quantum pushdown automaton model that has a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.05.026